|
Ranked pairs (RP) or the Tideman method is a voting system developed in 1987 by Nicolaus Tideman that selects a single winner using votes that express preferences. RP can also be used to create a sorted list of winners. If there is a candidate who is preferred over the other candidates, when compared in turn with each of the others, RP guarantees that candidate will win. Because of this property, RP is, by definition, a Condorcet method. == Procedure == The RP procedure is as follows: # Tally the vote count comparing each pair of candidates, and determine the winner of each pair (provided there is not a tie) # Sort (rank) each pair, by the largest strength of victory first to smallest last. # "Lock in" each pair, starting with the one with the largest number of winning votes, and add one in turn to a graph as long as they do not create a cycle (which would create an ambiguity). The completed graph shows the winner. RP can also be used to create a sorted list of preferred candidates. To create a sorted list, repeatedly use RP to select a winner, remove that winner from the list of candidates, and repeat (to find the next runner up, and so forth). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「ranked pairs」の詳細全文を読む スポンサード リンク
|